Belief Erasure Using Partial Imaging

نویسندگان

  • Raghav Ramachandran
  • Abhaya C. Nayak
  • Mehmet A. Orgun
چکیده

In this work we develop and examine a generalized account of David Lewis’s imaging in the same way as how Jeffrey’s Probability Kinematics generalizes Bayesian conditionalization. We show that this naturally leads to a rational account of probabilistic belief removal – a rather long standing problem in the area. It turns out that our generalization of imaging indeed is an account of probabilistic belief erasure as opposed to probabilistic belief contraction. In the process we also examine two other accounts of probabilistic belief removal which are rather novel and difficult to classify under the standard belief change taxonomy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel

In this paper, we develop a new channel model, which we name the q-ary partial erasure channel (QPEC). The QPEC has a q-ary input, and its output is either one symbol or a set of M symbols, where M may be smaller than q. This channel serves as a generalization to the binary erasure channel (BEC), and mimics situations when a symbol output from the channel is known only partially; that is, the o...

متن کامل

A Non-MDS Erasure Code Scheme for Storage Applications

This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...

متن کامل

Spatially Coupled LDPC Ensembles on Burst Erasure Channels

Spatially-Coupled LDPC (SC-LDPC) ensembles have gained significant interest since they were shown to universally achieve the capacity of binary memoryless channels under low-complexity belief-propagation decoding. In this work, we focus on the performance of these ensembles over binary erasure channels affected additionally by bursts. We assume that the burst can erase either a complete spatial...

متن کامل

Iterative Algorithms For Lossy Source Coding

This thesis explores the problems of lossy source coding and information embedding. For lossy source coding, we analyze low density parity check (LDPC) codes and low density generator matrix (LDGM) codes for quantization under a Hamming distortion. We prove that LDPC codes can achieve the rate-distortion function. We also show that the variable node degree of any LDGM code must become unbounded...

متن کامل

The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number

We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) code and belief propagation (BP) decoding. The bit error probability for infinite block length is known by density evolution [3] and it is well known that a difference between the bit error probability at finite iteration number for finite block length n and for infinite block length is asympto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010